A Block World Problem Based Sudoku Solver
نویسندگان
چکیده
There are many approaches proposed for solving Sudoku puzzles. One of them is by modelling the puzzles as block world problems. There have been three model for Sudoku solvers based on this approach. Each model expresses Sudoku solver as a parameterized multi agent systems. In this work, we propose a new model which is an improvement over the existing models. This paper presents the development of a Sudoku solver that implements all the proposed models. Some experiments have been conducted to determine the performance of each model. Keywords—Sudoku puzzle, Sudoku solver, block world problem, parameterized multi agent systems.
منابع مشابه
A Sudoku Solver
Article describes a Sudoku solver based on the compatibility matrix method.
متن کاملSolving Puzzles ( Eg . Sudoku ) and Other Combinatorial Problems with Sat
There are many combinatorial puzzles around the world. Solving these puzzles is an intellectual challenge to human kinds. In computing, one way of solving these combinatorial puzzles is by modeling them as a satisfiablility problem (SAT). The SAT problem is to find given a propositional logic formula an assignment of the variables which makes the formula true. In this project, we use Sudoku, th...
متن کاملNew Developments in Artificial Intelligence and the Semantic Web
This paper discusses solving and generating Sudoku puzzles with evolutionary algorithms. Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon. As an optimization problem Sudoku belongs to the group of combinatorial problems, but it is also a constraint satisfaction problem. The objective of this paper is to test if genetic algorithm optimization is an efficient method ...
متن کاملSudokuBee: An Artificial Bee Colony-based Approach in Solving Sudoku puzzles
Sudoku is a popular newspaper puzzle that has become an international phenomenon. Sudoku which means “single digits” is a logicbased combinatorial puzzle with rules that are quite simple. Several algorithms have been used to solve this combinatorial optimization problem. This paper explores the possibility of using the Artificial Bee Colony (ABC) algorithm, a relatively new swarm-based optimiza...
متن کاملA Pencil-and-Paper Algorithm for Solving Sudoku Puzzles
T he puzzle Sudoku has become the passion of many people the world over in the past few years. The interesting fact about Sudoku is that it is a trivial puzzle to solve. The reason it is trivial to solve is that an algorithm exists for Sudoku solutions. The algorithm is a tree-based search algorithm based on backtracking in a tree until a solution is found. If all a person needs to do is sit do...
متن کامل